In mathematics, an absorbing element is a special type of element of a set with respect to a binary operation on that set. The result of combining an absorbing element with any element of the set is the absorbing element itself. In semigroup theory, the absorbing element is called a zero element[1][2] because there is no risk of confusion with other notions of zero. In this article the two notions are synonymous.
Formally, let (S, ∘) be a set S with a binary operation ∘ on it (known as a magma). A zero element is an element z such that for all s in S, z∘s=s∘z=z. A refinement[2] are the notions of left zero, where one requires only that z∘s=z, and right zero, where s∘z=z.
Absorbing elements are particularly interesting for semigroups, especially the multiplicative semigroup of a semiring. In the case of a semiring with 0, the definition of an absorbing element is sometimes relaxed so that it is not required to absorb 0; otherwise, 0 would be the only absorbing element.[3]
set | operation | absorber |
---|---|---|
real numbers | · (multiplication) | 0 |
nonnegative integers | greatest common divisor | 1 |
n-by-n square matrices | · (multiplication) | matrix of all zeroes |
extended real numbers | minimum/infimum | −∞ |
extended real numbers | maximum/supremum | +∞ |
sets | ∩ (intersection) | { } (empty set) |
subsets of a set M | ∪ (union) | M |
boolean logic | ∧ (logical and) | ⊥ (falsity) |
boolean logic | ∨ (logical or) | ⊤ (truth) |